Search results for "Penalized Likelihood"

Dynamic factorial graphical models for dynamic networks

2014

Dynamic networks models describe a growing number of important scientific processes, from cell biology and epidemiology to sociology and finance. Estimating dynamic networks from noisy time series data is a difficult task since the number of components involved in the system is very large. As a result, the number of parameters to be estimated is typically larger than the number of observations. However, a characteristic of many real life networks is that they are sparse. For example, the molec- ular structure of genes make interactions with other components a highly-structured and, therefore, a sparse process. Penalized Gaussian graphical models have been used to estimate sparse networks. H…

Sparse model-based network inference using Gaussian graphical models

2010

We consider the problem of estimating a sparse dynamic Gaussian graphical model with L1 penalized maximum likelihood of structured precision matrix. The structure can consist of specific time dynamics, known presence or absence of links in the graphical model or equality constraints on the parameters. The model is defined on the basis of partial correlations, which results in a specific class precision matrices. A priori L1 penalized maximum likelihood estimation in this class is extremely difficult, because of the above mentioned constraints, the computational complexity of the L1 constraint on the side of the usual positive-definite constraint. The implementation is non-trivial, but we sh…

Model selection for penalized Gaussian Graphical Models

2013

High-dimensional data refers to the case in which the number of parameters is of one or more order greater than the sample size. Penalized Gaussian graphical models can be used to estimate the conditional independence graph in high-dimensional setting. In this setting, the crucial issue is to select the tuning parameter which regulates the sparsity of the graph. In this paper, we focus on estimating the "best" tuning parameter. We propose to select this tuning parameter by minimizing an information criterion based on the generalized information criterion and to use a stability selection approach in order to obtain a more stable graph. The performance of our method is compared with the state…

A new tuning parameter selector in lasso regression

2019

Penalized regression models are popularly used in high-dimensional data analysis to carry out variable selction and model fitting simultaneously. Whereas success has been widely reported in literature, their performance largely depend on the tuning parameter that balances the trade-off between model fitting and sparsity. In this work we introduce a new tuning parameter selction criterion based on the maximization of the signal-to-noise ratio. To prove its effectiveness we applied it to a real data on prostate cancer disease.

Penalized inference in multivariate ordered logistic models: theory and applications

2011

Graphical models for estimating dynamic networks

2012

Het bepalen van dynamische netwerken met behulp van data is een actief onderzoeksgebied, met name in de systeem biologie. Het schatten van de structuur van een netwerk heeft te maken met het bepalen van de aan of afwezigheid van een relatie tussen de hoekpunten in de graaf. Grafische modellen definiëren deze relaties via conditionele afhankelijkheid. In Gaussiaanse grafische modellen (GGM) wordt verondersteld dat de hoekpunten een normale verdeling volgen. Dit heeft grote voordelen vanwege de computationele handelbaarheid van GGM. Standaard GGM zijn echter niet bruikbaar om grote netwerken te bestuderen, i.e. als het aantal waarnemingen minder is dan het aantal hoekpunten van de graaf. Rece…

Penalized inference in multivariate ordered logistic models: theory and applications

2010

Inferring networks from high-dimensional data with mixed variables

2014

We present two methodologies to deal with high-dimensional data with mixed variables, the strongly decomposable graphical model and the regression-type graphical model. The first model is used to infer conditional independence graphs. The latter model is applied to compute the relative importance or contribution of each predictor to the response variables. Recently, penalized likelihood approaches have also been proposed to estimate graph structures. In a simulation study, we compare the performance of the strongly decomposable graphical model and the graphical lasso in terms of graph recovering. Five different graph structures are used to simulate the data: the banded graph, the cluster gr…

Penalized logistic regression for small or sparse data: interval estimators revisited

2015

This paper focuses on interval estimation in logistic regression models fitted through the Firth penalized log-likelihood. In this context, many authors have claimed superiority of the Likelihood ratio statistic with respect to the (wrong) Wald statistic via simulation evidence. We re-assess such findings by detailing the inferential tools also including in the comparisons the (right) Wald statistic and other statistics neglected in previous literature. In particular, we assess performances of the CIs estimators by simulation and compare them in a real data set. Differently from previous findings, the Likelihood ratio statistic does not appear to be the best inferential device in Firth pena…

An association model for bivariate data with application to the anlysis of university students' success.

2015

The academic success of students is a priority for all universities. We analyze the students' success at university by considering their performance in terms of both ‘qualitative performance’, measured by their mean grade, and ‘quantitative performance’, measured by university credits accumulated. These data come from an Italian University and concern a cohort of students enrolled at the Faculty of Economics. To jointly model both the marginal relationships and the association structure with covariates, we fit a bivariate ordered logistic model by penalized maximum likelihood estimation. The penalty term we use allows us to smooth the association structure and enlarge the range of possible …